Selecting Optimal Step engths for Adaptive Vector Quantizers

نویسنده

  • Lachlan L. H. Andrew
چکیده

This paper presents expressions for the optimal step length to use when training a vector quantizer by stochastic approximation. By treating each update as an estimation problem, it provides a unified framework covering both batch and incremental training, which were previously treated separately, and extends existing results to the semibatch case. In addition, the new results presented here provide a measurable improvement over results which were previously thought to be optimal.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Family of Variable Step-Size Normalized Subband Adaptive Filter Algorithms Using Statistics of System Impulse Response

This paper presents a new variable step-size normalized subband adaptive filter (VSS-NSAF) algorithm. The proposed algorithm uses the prior knowledge of the system impulse response statistics and the optimal step-size vector is obtained by minimizing the mean-square deviation(MSD). In comparison with NSAF, the VSS-NSAF algorithm has faster convergence speed and lower MSD. To reduce the computa...

متن کامل

Quantization based on a novel sample-adaptive product quantizer (SAPQ)

In this paper, we propose a novel feedforward adaptive quantization scheme called the sample-adaptive product quantizer (SAPQ). This is a structurally constrained vector quantizer that uses unions of product codebooks. SAPQ is based on a concept of adaptive quantization to the varying samples of the source and is very different from traditional adaptation techniques for nonstationary sources. S...

متن کامل

Approximating vector quantisation by transformation and scalar quantisation

Vector quantization provides better ratedistortion performance over scalar quantization even for a random vector with independent dimensions. However, the design and implementation complexity of vector quantizers is much higher than that of scalar quantizers. To reduce the complexity while achieving performance close to optimal vector quantization and better than scalar quantization, we propose...

متن کامل

Bennett's integral for vector quantizers

This paper extends Bennett's integral from scalar to vector quantizers, giving a simple formula that expresses the rth-power distortion of a many-point vector quantizer in terms of the number of points, point density function, inertial profile and the distribution of the source. The inertial profile specifies the normalized moment of inertia of quantization cells as a function of location. The ...

متن کامل

Vector quantization and clustering in presence of censoring

We consider the problem of optimal vector quantization for random vectors with one censored component and applications to clustering of censored observations. We introduce the definitions of the empirical distortion and of the empirically optimal quantizer in presence of censoring and we establish the almost sure consistency of empirical design. Moreover, we provide a non asymptotic exponential...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004